On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Mutually Orthogonal Graph-Path Squares

A decomposition { } s G G G − = 0 1 1 , , ,   of a graph H is a partition of the edge set of H into edgedisjoint subgraphs s G G G − 0 1 1 , , ,  . If i G G ≅ for all { } i s ∈ − 0,1, , 1  , then  is a decomposition of H by G. Two decompositions { } n G G G − = 0 1 1 , , ,   and { } n F F F − = 0 1 1 , , ,   of the complete bipartite graph n n K , are orthogonal if, ( ) ( ) i j E G F =...

متن کامل

More mutually orthogonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.

متن کامل

Maximal sets of mutually orthogonal Latin squares

Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in nitely many new pairs (s; v). c © 1999 Published by Elsevier Science B.V. All rights reserved

متن کامل

Interactive Orthogonal Graph Drawing

Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenaria, p...

متن کامل

6. Orthogonal Graph Drawing

There are various criteria to judge the quality of a drawing of a graph. From a human point of view, one of the most important issues is the readability of a drawing: ideally, it should be easy to understand the structure of a graph with just a few glances, and the chance of confusion over connections between different vertices should be small. From an algorithmic point of view, it is necessary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2020

ISSN: 2073-8994

DOI: 10.3390/sym12111895